| Definitions | x:A  B(x),  b, ES, s = t, x:A  B(x), AbsInterface(A), left + right, E(X), P  Q,  x:A. B(x), (e < e'), e c e', let x,y = A in B(x;y), t.1, E, case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , Top, f(a), e   X, {x:A| B(x)} , t T, s ~ t, P   Q, prior-f-fixedpoints(e), f**(e), last(L), EState(T), a:A fp B(a), Id,  , strong-subtype(A;B), Type, EqDecider(T), Unit, IdLnk, EOrderAxioms(E; pred?; info), kindcase(k; a.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r s, e < e',  , constant_function(f;A;B), SWellFounded(R(x;y)),  , pred!(e;e'),   x,y. t(x;y), Void,  x:A.B(x), S  T, suptype(S; T), first(e),  A, <a, b>, pred(e), x.A(x), x. t(x), P & Q, (x l), ff, b, tt, False, P  Q, p q, p  q, p q, {T}, SQType(T), e = e', hd(l), i <z j, i z j, l[i], [], [car / cdr], as @ bs, A List , X(e), p =b q, (i = j), x =a y, null(as), a < b, x f y, a < b, [d], eq_atom$n(x;y), q_le(r;s), q_less(a;b), qeq(r;s), a = b, a = b, deq-member(eq;x;L), prior(X),  T, y is f*(x),  x:A. B(x), y=f*(x) via L, True, A c B |